Search in Random Media with Lévy Flights
نویسندگان
چکیده
Our work on the subject of search has been motivated by a variety of applications in engineering and technology, and it differs from the physicists’ motivation for such problems, e.g., or the motivation provided by biochemistry, and in theoretical biology . One of our reasons for a more fundamental approach to search comes from the area of traffic routing in wired networks where each end user may send out many search or Smart Packets to seek out paths for the traffic it needs to forward, so that the paths that are used will satisfy useful quality of service (QoS) properties such as minimising delay or packet loss. A similar question arises, with even more acuity, when the networks are ad-hoc and wireless, and the need to reduce uncertainty regarding possible paths is even greater. A distinct but related motivation for our work has been the search for network paths that avoid ongoing Cyberattacks. Another important motivation for our work comes from the field of explosive mine detection and removal on which one of us worked in the past, and in such circumstances it is sensible to see how the natural world deals with such challenges. The related fields of tactical operations, and emergency operations and management also raise many interesting problems related to the search for targets, objects such as landmines, and victims, as part of an organised response to an incident or an emergency. On the other hand, one of us first introduced Lévy flights in diffu-
منابع مشابه
Cuckoo search via Lévy flights for the capacitated vehicle routing problem
For this paper, we explored the implementation of the cuckoo search algorithm applied to the capacitated vehicle routing problem. The cuckoo search algorithm was implemented with Lévy flights with the 2-opt and double-bridge operations, and with 500 iterations for each run. The algorithm was tested on the problem instances from the Augerat benchmark dataset. The algorithm did not perform well o...
متن کاملLévy flights in binary optimization
There are many optimization heuristics which involves mutation operator. Reducing them to binary optimization allows to study properties of binary mutation operator. Modern heuristics yield from Lévy flights behavior, which is a bridge between local search and random shooting in binary space. The paper is oriented to statistical analysis of binary mutation with Lévy flight inside and Quantum Tu...
متن کاملLévy flights in inhomogeneous media.
We investigate the impact of external periodic potentials on superdiffusive random walks known as Lévy flights and show that even strongly superdiffusive transport is substantially affected by the external field. Unlike ordinary random walks, Lévy flights are surprisingly sensitive to the shape of the potential while their asymptotic behavior ceases to depend on the Lévy index mu. Our analysis ...
متن کاملCuckoo search via Levy flights applied to uncapacitated facility location problem
Facility location problem (FLP) is a mathematical way to optimally locate facilities within a set of candidates to satisfy the requirements of a given set of clients. This study addressed the uncapacitated FLP as it assures that the capacity of every selected facility is finite. Thus, even if the demand is not known, which often is the case, in reality, organizations may still be able to take s...
متن کاملFront dynamics in a two-species competition model driven by Lévy flights.
A number of recent studies suggest that many biological species follow a Lévy random walk in their search for food. Such a strategy has been shown to be more efficient than classical Brownian motion when resources are scarce. However, current diffusion-reaction models used to describe many ecological systems do not account for the superdiffusive spread of populations due to Lévy flights. We hav...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1305.3578 شماره
صفحات -
تاریخ انتشار 2013